Modified Frye–Morris polynomial model for double web-angle connections
نویسندگان
چکیده
منابع مشابه
Modified polynomial function model for reversed-field pinches
A generalized analytic representation for the magnetic field and current density profiles in a reversed-field pinch (RFP) is proposed. These profiles have zero current density at the wall and finite plasma pressure. The profiles are characterized by two free parameters here taken to be the field-reversal parameter (F> and pinch parameter (0). From the profiles, many useful quantities such as ma...
متن کاملNonparametric Regression Estimation under Kernel Polynomial Model for Unstructured Data
The nonparametric estimation(NE) of kernel polynomial regression (KPR) model is a powerful tool to visually depict the effect of covariates on response variable, when there exist unstructured and heterogeneous data. In this paper we introduce KPR model that is the mixture of nonparametric regression models with bootstrap algorithm, which is considered in a heterogeneous and unstructured framewo...
متن کاملAn Ensemble Click Model for Web Document Ranking
Annually, web search engine providers spend more and more money on documents ranking in search engines result pages (SERP). Click models provide advantageous information for ranking documents in SERPs through modeling interactions among users and search engines. Here, three modules are employed to create a hybrid click model; the first module is a PGM-based click model, the second module in a d...
متن کاملA Web-Based Bimatrix Game Optimization Model of Polynomial Complexity
The objective of this paper is the description, justification, and web-based implementation of polynomial time algorithms for equilibrium search of Quadratic Bimatrix Games (QBG). An algorithm is proposed combining exact and heuristic parts. The exact part has the Irelevant Fraud (IF) component for cases when an equilibrium exists with no pure strategies. The Direct Search (DS) component finds ...
متن کاملTutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings
For any graph G with n edges, the spanning subgraphs and the orientations of G are both counted by the evaluation TG(2, 2) = 2 n of its Tutte polynomial. We define a bijection Φ between spanning subgraphs and orientations and explore its enumerative consequences regarding the Tutte polynomial. The bijection Φ is closely related to a recent characterization of the Tutte polynomial relying on a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Structural Engineering
سال: 2015
ISSN: 2008-3556,2008-6695
DOI: 10.1007/s40091-015-0100-y